Colored Traveling Salesman Problem （CTSP） is a variant of Multiple Traveling Salesmen Problem （MTSP） and Traveling Salesman Problem （TSP）， which can be applied to the engineering problems such as Multi-machine Engineering System （MES） with overlapping workspace. CTSP is an NP complete problem， although related studies have attempted to solve the problem by Genetic Algorithm （SA）， Simulated Annealing （SA） algorithm and some other methods， but they solve the problem at a limited scale and with unsatisfactory speed and solution quality. Therefore， a hybrid IT? algorithm combined with Uniform Design （UD）， Ant Colony Optimization （ACO） and IT? algorithm was proposed to solve this problem， namely UDHIT?. UD was applied to choose the appropriate combination of parameters of the UDHIT? algorithm， the probabilistic graphic model of ACO was used to generate feasible solutions， and the drift operator and volatility operator of IT? were used to optimize the solutions. Experimental results show that the UDHIT? algorithm can demonstrate improvement over the traditional GA， ACO and IT? algorithm for the multi-scale CTSP problems in terms of best solution and average solution.